MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
نویسندگان
چکیده
منابع مشابه
Monotonic Abstraction: on Efficient Verification of Parameterized Systems
We introduce the simple and efficient method of monotonic abstraction to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions are guarded by both local and global conditions. Processes may communicate via broadcast, rendezvous and shared variables over finite domains. The method of monotonic abstract...
متن کاملMonotonic Abstraction in Parameterized Verification
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes which are organized in a linear array. The aim is to prove correctness of the system regardless of the number of processes inside the system. We give an overview of the method of monotonic abstraction, which provides an over-approximation of the transi...
متن کاملConstrained Monotonic Abstraction: A CEGAR for Parameterized Verification
In this paper, we develop a counterexample-guided abstraction refinement (CEGAR) framework for monotonic abstraction, an approach that is particularly useful in automatic verification of safety properties for parameterized systems. The main drawback of verification using monotonic abstraction is that it sometimes generates spurious counterexamples. Our CEGAR algorithm automatically extracts fro...
متن کاملEnvironment Abstraction for Parameterized Verification
Many aspects of computer systems are naturally modeled as parameterized systems which renders their automatic verification difficult. In wellknown examples such as cache coherence protocols and mutual exclusion protocols, the unbounded parameter is the number of concurrent processes which run the same distributed algorithm. In this paper, we introduce environment abstraction as a tool for the v...
متن کاملAbstraction Techniques for Parameterized Verification
ion Techniques for Parameterized Verification Muralidhar Talupur November 2006 CMU-CS-06-169 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Thesis Committee: Edmund M. Clarke, Chair Randal E. Bryant Amir Pnueli, New York University Jeannette M. Wing Copyright c © 2006 Muralid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2009
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054109006887